For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3
نویسندگان
چکیده
The homological niteness property F P 3 and the combinatorial property of having nite derivation type both are necessary conditions for nitely presented monoids to admit a nite convergent presentation. For monoids in general, the property of having nite derivation type is strictly stronger than the property F P 3. Here we show that for groups these two properties are equivalent. The proof exploits a result of 6], which states that a group G, which is given through a nite presentation hX; Ri, has nite derivation type if and only if the ZG-module of identities among relations that is associated with hX; Ri is nitely generated. We also give a new proof for this result which is much simpler than our original proof.
منابع مشابه
Homological Finite Derivation Type
In 1987 Squier defined the notion of finite derivation type for a finitely presented monoid. To do this, he associated a 2-complex to the presentation. The monoid then has finite derivation type if, modulo the action of the free monoid ring, the 1-dimensional homotopy of this complex is finitely generated. Cremanns and Otto showed that finite derivation type implies the homological finiteness c...
متن کاملHigher-dimensional normalisation strategies for acyclicity
We introduce acyclic polygraphs, a notion of complete categorical cellular model for (small) categories, containing generators, relations and higher-dimensional globular syzygies. We give a rewriting method to construct explicit acyclic polygraphs from convergent presentations. For that, we introduce higher-dimensional normalisation strategies, defined as homotopically coherent ways to relate e...
متن کاملA Polygraphic Survey on Finiteness Conditions for Rewriting Systems
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he has constructed finitely presented decidable monoids that cannot be presented by finite convergent rewriting systems. In 1994, Squier introduced the condition of finite derivation type, which is a h...
متن کاملPolygraphs of finite derivation type
Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a decidable word problem, but that cannot be presented by finite convergent rewriting systems. Later, he introduced the condition of finite derivation type, whic...
متن کاملFor Rewriting Systems
A finite rewriting system is presented that does not satisfy the homotopical finiteness condition FDT, although it satisfies the homological finiteness condition FHT. This system is obtained from a group G and a finitely generated subgroup H of G through a monoid extension that is almost an HNN-extension. The FHT property of the extension is closely related to the FP2 property for the subgroup ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 1996